Twenty-Five Years of Preferred Subtheories
نویسنده
چکیده
In the seminal paper [6], Gerd Brewka argued that ranking a set of default rules without prerequisites, and selecting extensions according to a lexicographic refinement of the inclusion ordering proves to be a natural, simple and efficient way of dealing with the multiple extension (or “subtheories”) problem. This natural idea has been reused, discussed, revisited, reinvented, adapted many times in the AI community and beyond. Preferred subtheories do not only have an interest in default reasoning, but also in reasoning about time, reasoning by analogy, reasoning with compactly represented preferences, judgment aggregation, and voting. They have several variants (but arguably not so many). In this short paper I will say as much as I can about preferred subtheories in sixteen pages. 1 Prioritized Default Theories and Preferred Subtheories Preferred subtheories were introduced in [6] as a way of representing and exploiting priorities between default rules. Their starting point was the THEORIST system [28] for default reasoning. In Poole’s system – equivalent to the restriction of Reiter’s default logic to normal defaults without prerequisites – a default theory is a set of facts F plus a set of hypotheses Δ (both composed of logical formulas) and an extension is the set of logical consequences of a set-inclusion maximal subset D of Δ such that D ∪ F is consistent. In spite of the (apparently drastic) restriction to normal defaults without prerequisites, this system is able to deal adequately with many of the standard default reasoning examples from the literature, but not all, because of the impossibility of expressing priorities between defaults. Let me reuse this example from [6], suggested to Gerd Brewka by Ulrich Junker. “Usually one has to go to a meeting. This rule does not apply if somebody is sick, unless he only has a cold. The rule is also not applicable if somebody is on vacation.” As shown by [6] (Section 3), given that the person is sick, the natural writing of this example in Poole’s system generates two extensions: one where she has to attend the meeting and one where she does not. In order to avoid this, one would need to “(...) look down in the hierarchy of exceptions and block defaults lower in the hierarchy. (...) the number of defaults may increase heavily in cases where more exceptions and exceptions of exceptions are involved” T. Eiter et al. (Eds.): Brewka Festschrift, LNAI 9060, pp. 157–172, 2015. c © Springer International Publishing Switzerland 2015
منابع مشابه
Consistency Management B Y Prioritized Minimal Revision (extended Abstract)
When we make a large software, we rstly decide requirements speci cation for the software. We, however, have to change the initial speci cation when unexpected exceptions and changes of environments occur. When we change speci cation, we usually do not discard the whole speci cation, but we keep most part of speci cation which is irrelevant to the change, that is, we perform a minimal revision ...
متن کاملتعیین و مقایسه ظرفیت خازنی عاج در دندانهای جوان و مسن
Introduction: Determining working length is regarded as an important step in root canal treatment, for which electronic apex locator can be applied. New apex locators are preferred, since they work via applying alternating current. Furthermore, the two factors of dentin specific resistance and capacitance seem to be effective principles in their operating. Therefore, this study aimed to determi...
متن کاملA Cumulative-Model Semantics for Dynamic Preferences on Assumptions
Explicit preferences on assumptions as used in prioritized circumscription [McCarthy, 1986; Lifschitz, 1985; Grosof, 1991] and preferred subtheories [Brewka, 1989] provide a clear and declarative method for defining preferred models. In this paper, we show how to embed preferences in the logical theory itself. This gives a high freedom for expressing statements about preferences. Preferences ca...
متن کاملToward Caching Symmetrical Subtheories for Weighted Model Counting
Model counting and weighted model counting are key problems in artificial intelligence. Marginal inference can be reduced to model counting in many statistical-relational systems, such as Markov Logic. One common approach used by model counters is splitting a theory into disjoint subtheories, performing model counting on the subtheories, and then caching the result. If an identical subtheory is...
متن کاملبررسی راهبرد منتخب تأمین مالی کارآفرینان مستقل استان مازندران (بخش کشاورزی)
Due to the importance of financing, this research is aimed at evaluating the financing strategies of independent entrepreneurs of agriculture sector in Mazandaran province. Hence, along with a comprehensive literature review in the field of the research, the historical documents of twenty- five agricultural entrepreneurs of Mazandaran province were studied. Afterwards, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015